Generalized Unimodular Loop Transformations for Distributed Memory Multiprocessors
نویسندگان
چکیده
In this paper, we present a generalized unimodular loop transformation as a simple, systematic and elegant method for partitioning the iteration spaces of nested loops for execution on distributed memory multiprocessors. We present a methodology for deriving the transformations that internalize multiple dependences in a multidimen-sional iteration space without resulting in a deadlocking situation. We then derive the general expression for the bounds of the transformed loops in terms of the bounds of the original space and the transformation matrix elements.
منابع مشابه
Multi-transformations: Code Generation and Validity
In this paper we present a generalization of the framework of unimodular loop transformations for parallelizing compilers, called multitransformations. Multi-transformations consist of applying a di erent unimodular transformation to the iteration space of each statement in the loop body, and include also alignments. Two key aspects are considered in this paper: the generation of e cient code t...
متن کاملNon - unimodular Transformations of Nested
This paper presents a linear algebraic approach to modeling loop transformations. The approach uniies apparently unrelated recent developments in super-compiler technology. Speciically we show the relationship between the dependence abstraction called dependence cones, and fully permutable loop nests. Compound transformations are modeled as matrices. Non-singular linear transformations presente...
متن کاملLocality Analysis for Distributed Shared-Memory Multiprocessors
This paper studies the locality analysis problem for shared-memory multiprocessors, a class of parallel machines that has experienced steady and rapid growth in the past few years. The focus of this work is on estimation of the memory performance of a loop nest for a given set of computation and data distributions. We assume a distributed shared-memory multiprocessor model. We discuss how to es...
متن کاملReview of A Data Locality Optimizing Algorithm
What problem did the paper address? Who is the intended audience? The big picture problem is how can we improve program performance given the large latency between the processor and memory. The audience is compiler researchers and writers because they are focusing on an existing compilation technique called tiling, which was developed to avoid memory access latency . The paper addresses the pro...
متن کاملLinear and Extended Linear Transformations for Shared-Memory Multiprocessors
Advances in program transformation frameworks have signi"cantly advanced compiler technology over the past few years. Program transformation frameworks provide mathematical abstractions of loop and data structures and formal methods for manipulating these structures. It is these frameworks that have allowed the development of algorithms capable of automatically tailoring an application for a ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991